An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
نویسندگان
چکیده
منابع مشابه
An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heur...
متن کاملPartitioning a rectangle into small perimeter rectangles
Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles, Discrete Mathematics 103 (1992) 111-119. We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k 1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having th...
متن کاملOn Partitioning and Packing Products with Rectangles
In [1] we introduced and studied for product hypergraphs Hn = Qni=1Hi , where Hi = (Vi; Ei) , the minimal size (Hn) of a partition of Vn =Qni=1 Vi into sets that are elements of En = Qni=1 Ei . The main result was that (Hn) = n Y i=1 (Hi); (1) if the Hi's are graphs with all loops included. A key step in the proof concerns the special case of complete graphs. Here we show that (1) also holds wh...
متن کاملOptimal Rectangle Packing: An Absolute Placement Approach
We consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Our rectangle packer chooses the xcoordinates of all the rectangles before any of the y-coordinates. We then transform the problem into a perfect-packing problem with no empty space by adding additional rectangles. To determine the y-coordinates, we branch on t...
متن کاملSymmetry-breaking constraints for packing identical rectangles within polyhedra
Two problems related to packing identical rectangles within a polyhedron are tackled in the present work. Rectangles are allowed to differ only by horizontal or vertical translations and possibly ninety-degree rotations. The first considered problem consists in packing as many identical rectangles as possible within a given polyhedron, while the second problem consists in finding the smallest p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2010
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.2008.141